Constructing the Ideal EVE Online Player
نویسندگان
چکیده
EVE Online, released in 2003 by CCP Games, is a space-themed Massively Multiplayer Online Game (MMOG). This sandbox style MMOG has a reputation for being a difficult game with a punishing learning curve that is fairly impenetrable to new players. This has led to the widely held belief among the larger MMOG community that “EVE players are different”, as only a very particular type of player would be dedicated to learning how to play a game this challenging. Taking a critical approach to the claim that “EVE players are different”, this paper complicates the idea that only a certain type of player capable of playing the most hardcore of games will be attracted to this particular MMOG. Instead, we argue that EVE’s “exceptionalism” is actually the result of conscious design decisions on the part of CCP games, which in turn compel particular behaviours that are continually reinforced as the norm by the game’s relatively homogenous player community.
منابع مشابه
EVE is Real
Used in a wide variety of contexts, a common colloquialism among EVE Online players is the phrase ‘EVE is real’. In this paper, we examine the various ways in which EVE is considered ‘real’ by its players, identifying a nuanced and powerful concept that goes significantly beyond real/virtual distinctions that have already been critiqued in game studies literature. We argue that, as a form of pa...
متن کاملIntelligent Trading Agents for Massively Multi-player Game Economies
As massively multi-player gaming environments become more detailed, developing agents to populate these virtual worlds as capable non-player characters poses an increasingly complex problem. Human players in many games must achieve their objectives through financial skills such as trading and supply chain management as well as through combat and diplomacy. In this paper, we examine the problem ...
متن کاملUndecidability of Two-dimensional Robot Games
Robot game is a two-player vector addition game played on the integer lattice Z. Both players have sets of vectors and in each turn the vector chosen by a player is added to the current configuration vector of the game. One of the players, called Eve, tries to play the game from the initial configuration to the origin while the other player, Adam, tries to avoid the origin. The problem is to de...
متن کاملAbsolutely Secure Message Transmission using a Key Sharing Graph
Assume that there are players and an eavesdropper Eve of unlimited computational power and that several pairs of players have shared secret keys beforehand. A key sharing graph is one in which each vertex corresponds to a player, and each edge corresponds to a secret key shared by the two players corresponding to the ends of the edge. Given a key sharing graph, a player wishes to send a message...
متن کاملQuantitative Games with Interval Objectives
Traditionally quantitative games such as mean-payoff games and discount sum games have two players – one trying to maximize the payoff, the other trying to minimize it. The associated decision problem, “Can Eve (the maximizer) achieve, for example, a positive payoff?” can be thought of as one player trying to attain a payoff in the interval (0,∞). In this paper we consider the more general prob...
متن کامل